/*
 * @lc app=leetcode.cn id=674 lang=cpp
 *
 * [674] 最长连续递增序列
 */

// @lc code=start
#include <bits/stdc++.h>
using namespace std;
class Solution
{
public:
    int findLengthOfLCIS(vector<int> &nums)
    {
        int l = 0, r = 1;
        int ans = 1;
        while (r < nums.size())
        {
            while (r < nums.size() && nums[r] > nums[r - 1])
                r++;
            ans = std::max(ans, r - l);
            l = r;
            r++;
        }
        return ans;
    }
};
// @lc code=end
